Fitting Genetic Models Using Markov Chain Monte Carlo Algorithms With BUGS
نویسندگان
چکیده
منابع مشابه
Fitting genetic models using Markov Chain Monte Carlo algorithms with BUGS.
Maximum likelihood estimation techniques are widely used in twin and family studies, but soon reach computational boundaries when applied to highly complex models (e.g., models including gene-by-environment interaction and gene-environment correlation, item response theory measurement models, repeated measures, longitudinal structures, extended pedigrees). Markov Chain Monte Carlo (MCMC) algori...
متن کاملMulti-resolution Genetic Algorithms and Markov Chain Monte Carlo
Due to modern advances in computing power, the use of increasingly complex models has become practical. One class of large models that often relies on numerical techniques for parameter estimation is multiresolution models. Unfortunately, numerical maximization and sampling techniques used to estimate parameters in such complex models often explore the parameter space slowly, resulting in unrel...
متن کاملOn Adaptive Markov Chain Monte Carlo Algorithms
Abstract We look at adaptive MCMC algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the past of the process. We show under certain conditions that the generated stochastic process is ergodic, with appropriate stationary distribution. We then consider the Random Walk Metropolis (RWM) algorithm with normal ...
متن کاملSpeeeding Up Markov Chain Monte Carlo Algorithms
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller space, such that the aggregated chain approximately preserves the Markov property.
متن کاملTuning of Markov Chain Monte Carlo Algorithms Using Copulas
Algoritmii de tipul Metropolis-Hastings se constituie ı̂ntr-una dintre cele mai folosite clase de algoritmi Monte Carlo cu lanţuri Markov (MCMC). Eficienta implementare a acestor algoritmi depinde ı̂n mare măsură de abilitatea utilizatorului de a crea o bună distributie de propunere. In această lucrare propunem o metodă de construcţie a distribuţiei de propunere bazată pe modele cu copule. Dacă d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Twin Research and Human Genetics
سال: 2006
ISSN: 1832-4274,0000-0000
DOI: 10.1375/183242706777591399